<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.14"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>NumCpp: StlAlgorithms.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
  $(document).ready(initResizable);
/* @license-end */</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">NumCpp
   &#160;<span id="projectnumber">1.0</span>
   </div>
   <div id="projectbrief">A C++ implementation of the Python Numpy library</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.14 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('_stl_algorithms_8hpp_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">StlAlgorithms.hpp</div>  </div>
</div><!--header-->
<div class="contents">
<a href="_stl_algorithms_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#pragma once</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#include &lt;iterator&gt;</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">#include &lt;numeric&gt;</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">#include &lt;utility&gt;</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor">#if defined(__cpp_lib_execution) &amp;&amp; defined(__cpp_lib_parallel_algorithm)</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="preprocessor">#define PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="preprocessor">#include &lt;execution&gt;</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacenc.html">nc</a></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;{</div><div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html">   43</a></span>&#160;    <span class="keyword">namespace </span>stl_algorithms</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;    {</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt, <span class="keyword">class</span> UnaryPredicate&gt;</div><div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a74975591483e3e27b6de4c63bf5ff897">   55</a></span>&#160;        <span class="keywordtype">bool</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a74975591483e3e27b6de4c63bf5ff897">all_of</a>(InputIt first, InputIt last, UnaryPredicate p)</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        {</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a74975591483e3e27b6de4c63bf5ff897">std::all_of</a>(std::execution::par_unseq, first, last, p);</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a74975591483e3e27b6de4c63bf5ff897">std::all_of</a>(first, last, p);</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        }</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt, <span class="keyword">class</span> UnaryPredicate&gt;</div><div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a86175072e60e0fabc931a8acd6329c77">   74</a></span>&#160;        <span class="keywordtype">bool</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a86175072e60e0fabc931a8acd6329c77">any_of</a>(InputIt first, InputIt last, UnaryPredicate p)</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        {</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a86175072e60e0fabc931a8acd6329c77">std::any_of</a>(std::execution::par_unseq, first, last, p);</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a86175072e60e0fabc931a8acd6329c77">std::any_of</a>(first, last, p);</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        }</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt, <span class="keyword">class</span> OutputIt&gt;</div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#afc0a193758bfb62333c4ed53ada9537d">   93</a></span>&#160;        OutputIt <a class="code" href="namespacenc_1_1stl__algorithms.html#afc0a193758bfb62333c4ed53ada9537d">copy</a>(InputIt first, InputIt last, OutputIt destination)</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;        {</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#afc0a193758bfb62333c4ed53ada9537d">std::copy</a>(std::execution::par_unseq, first, last, destination);</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#afc0a193758bfb62333c4ed53ada9537d">std::copy</a>(first, last, destination);</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        }</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt, <span class="keyword">class</span> T&gt;</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keyword">typename</span> std::iterator_traits&lt;InputIt&gt;::difference_type</div><div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#ae1e1834ec458e90544d643b4b1e68735">  113</a></span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#ae1e1834ec458e90544d643b4b1e68735">count</a>(InputIt first, InputIt last, <span class="keyword">const</span> T &amp;value)</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        {</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ae1e1834ec458e90544d643b4b1e68735">std::count</a>(std::execution::par_unseq, first, last, value);</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ae1e1834ec458e90544d643b4b1e68735">std::count</a>(first, last, value);</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        }</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt1, <span class="keyword">class</span> InputIt2&gt;</div><div class="line"><a name="l00132"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#ab200b92040bf3da8ee4325f5a994e73d">  132</a></span>&#160;        <span class="keywordtype">bool</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ab200b92040bf3da8ee4325f5a994e73d">equal</a>(InputIt1 first1, InputIt1 last1,</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;            InputIt2 first2) noexcept</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;        {</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a684d1011b375da4078afb4474a36b0e6">std::equal</a>(std::execution::par_unseq, first1, last1, first2);</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a684d1011b375da4078afb4474a36b0e6">std::equal</a>(first1, last1, first2);</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;        }</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt1, <span class="keyword">class</span> InputIt2, <span class="keyword">class</span> BinaryPredicate&gt;</div><div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a684d1011b375da4078afb4474a36b0e6">  153</a></span>&#160;        <span class="keywordtype">bool</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ab200b92040bf3da8ee4325f5a994e73d">equal</a>(InputIt1 first1, InputIt1 last1,</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;            InputIt2 first2, BinaryPredicate p) noexcept</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;        {</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a684d1011b375da4078afb4474a36b0e6">std::equal</a>(std::execution::par_unseq, first1, last1, first2, p);</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a684d1011b375da4078afb4474a36b0e6">std::equal</a>(first1, last1, first2, p);</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        }</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> ForwardIt, <span class="keyword">class</span> T&gt;</div><div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#abbc2e8d742b76f4c2bead6ae894bc4e3">  172</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#abbc2e8d742b76f4c2bead6ae894bc4e3">fill</a>(ForwardIt first, ForwardIt last, <span class="keyword">const</span> T&amp; value)</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        {</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#abbc2e8d742b76f4c2bead6ae894bc4e3">std::fill</a>(std::execution::par_unseq, first, last, value);</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#abbc2e8d742b76f4c2bead6ae894bc4e3">std::fill</a>(first, last, value);</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;        }</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt, <span class="keyword">class</span> T&gt;</div><div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#ab372e4e815977d16f647cdcfea3f1ea5">  192</a></span>&#160;        InputIt <a class="code" href="namespacenc_1_1stl__algorithms.html#ab372e4e815977d16f647cdcfea3f1ea5">find</a>(InputIt first, InputIt last, <span class="keyword">const</span> T&amp; value)</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;        {</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ab372e4e815977d16f647cdcfea3f1ea5">std::find</a>(std::execution::par_unseq, first, last, value);</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ab372e4e815977d16f647cdcfea3f1ea5">std::find</a>(first, last, value);</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;        }</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt, <span class="keyword">class</span> UnaryFunction&gt;</div><div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a734698435eabdbc5bdf93b195d7fb6a7">  210</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a734698435eabdbc5bdf93b195d7fb6a7">for_each</a>(InputIt first, InputIt last, UnaryFunction <a class="code" href="namespacenc_1_1random.html#a00229c23da25284daf436c0a338ea25c">f</a>)</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;        {</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a734698435eabdbc5bdf93b195d7fb6a7">std::for_each</a>(std::execution::par_unseq, first, last, <a class="code" href="namespacenc_1_1random.html#a00229c23da25284daf436c0a338ea25c">f</a>);</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a734698435eabdbc5bdf93b195d7fb6a7">std::for_each</a>(first, last, <a class="code" href="namespacenc_1_1random.html#a00229c23da25284daf436c0a338ea25c">f</a>);</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;        }</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt1, <span class="keyword">class</span> InputIt2, <span class="keyword">class</span> T&gt;</div><div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a237a7b4514eff72fc35084f7004464d1">  230</a></span>&#160;        T <a class="code" href="namespacenc_1_1stl__algorithms.html#a237a7b4514eff72fc35084f7004464d1">inner_product</a>(InputIt1 first1, InputIt1 last1, InputIt2 first2, T init)</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;        {</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;            <span class="keywordflow">return</span> std::transform_reduce(std::execution::par_unseq, first1, last1, first2, init);</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a237a7b4514eff72fc35084f7004464d1">std::inner_product</a>(first1, last1, first2, init);</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;        }</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> ForwardIt&gt;</div><div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a42bf8acb4c60400df32819dfd2507b33">  248</a></span>&#160;        <span class="keywordtype">bool</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a42bf8acb4c60400df32819dfd2507b33">is_sorted</a>(ForwardIt first, ForwardIt last)</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        {</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a42bf8acb4c60400df32819dfd2507b33">std::is_sorted</a>(std::execution::par_unseq, first, last);</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a42bf8acb4c60400df32819dfd2507b33">std::is_sorted</a>(first, last);</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        }</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> ForwardIt&gt;</div><div class="line"><a name="l00266"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a8f91b4c9610973486b45eab8a5f04d3f">  266</a></span>&#160;        ForwardIt <a class="code" href="namespacenc_1_1stl__algorithms.html#a8f91b4c9610973486b45eab8a5f04d3f">max_element</a>(ForwardIt first, ForwardIt last)</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        {</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a8f91b4c9610973486b45eab8a5f04d3f">std::max_element</a>(std::execution::par_unseq, first, last);</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a8f91b4c9610973486b45eab8a5f04d3f">std::max_element</a>(first, last);</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;        }</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> ForwardIt&gt;</div><div class="line"><a name="l00283"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#ab886383a0452b7240cf97d80b569e858">  283</a></span>&#160;        ForwardIt <a class="code" href="namespacenc_1_1stl__algorithms.html#ab886383a0452b7240cf97d80b569e858">min_element</a>(ForwardIt first, ForwardIt last)</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;        {</div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ab886383a0452b7240cf97d80b569e858">std::min_element</a>(std::execution::par_unseq, first, last);</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ab886383a0452b7240cf97d80b569e858">std::min_element</a>(first, last);</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;        }</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> ForwardIt&gt;</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;        std::pair&lt;ForwardIt, ForwardIt&gt;</div><div class="line"><a name="l00302"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#ae2ab2d36f54efc167ea074348b0319fa">  302</a></span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#ae2ab2d36f54efc167ea074348b0319fa">minmax_element</a>(ForwardIt first, ForwardIt last)</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        {</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ae2ab2d36f54efc167ea074348b0319fa">std::minmax_element</a>(std::execution::par_unseq, first, last);</div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#ae2ab2d36f54efc167ea074348b0319fa">std::minmax_element</a>(first, last);</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;        }</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;</div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt, <span class="keyword">class</span> UnaryPredicate&gt;</div><div class="line"><a name="l00321"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#aa8f79e15f5d691cc61bf56bd4299afed">  321</a></span>&#160;        <span class="keywordtype">bool</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#aa8f79e15f5d691cc61bf56bd4299afed">none_of</a>(InputIt first, InputIt last, UnaryPredicate p)</div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;        {</div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#aa8f79e15f5d691cc61bf56bd4299afed">std::none_of</a>(std::execution::par_unseq, first, last, p);</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#aa8f79e15f5d691cc61bf56bd4299afed">std::none_of</a>(first, last, p);</div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;        }</div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;</div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> RandomIt&gt;</div><div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a946075f627d142f66626b03c30de8a16">  339</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a946075f627d142f66626b03c30de8a16">nth_element</a>(RandomIt first, RandomIt nth, RandomIt last)</div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        {</div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a946075f627d142f66626b03c30de8a16">std::nth_element</a>(std::execution::par_unseq, first, nth, last);</div><div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a946075f627d142f66626b03c30de8a16">std::nth_element</a>(first, nth, last);</div><div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;        }</div><div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;</div><div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> ForwardIt, <span class="keyword">class</span> T&gt;</div><div class="line"><a name="l00358"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a8674f754c02402908901506e8681839f">  358</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a8674f754c02402908901506e8681839f">replace</a>(ForwardIt first, ForwardIt last,</div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;            <span class="keyword">const</span> T&amp; oldValue, <span class="keyword">const</span> T&amp; newValue)</div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;        {</div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a8674f754c02402908901506e8681839f">std::replace</a>(std::execution::par_unseq, first, last, oldValue, newValue);</div><div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a8674f754c02402908901506e8681839f">std::replace</a>(first, last, oldValue, newValue);</div><div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;        }</div><div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;</div><div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> B<span class="keywordtype">id</span>irIt&gt;</div><div class="line"><a name="l00376"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a51eb1633787552e33ebede44bf5557a2">  376</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a51eb1633787552e33ebede44bf5557a2">reverse</a>(BidirIt first, BidirIt last)</div><div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;        {</div><div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a51eb1633787552e33ebede44bf5557a2">std::reverse</a>(std::execution::par_unseq, first, last);</div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a51eb1633787552e33ebede44bf5557a2">std::reverse</a>(first, last);</div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;        }</div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;</div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> ForwardIt&gt;</div><div class="line"><a name="l00394"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a79bd84376c57067a06ea0302f4fc261a">  394</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a79bd84376c57067a06ea0302f4fc261a">rotate</a>(ForwardIt first, ForwardIt firstN, ForwardIt last)</div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;        {</div><div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a79bd84376c57067a06ea0302f4fc261a">std::rotate</a>(std::execution::par_unseq, first, firstN, last);</div><div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a79bd84376c57067a06ea0302f4fc261a">std::rotate</a>(first, firstN, last);</div><div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;        }</div><div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;</div><div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt1, <span class="keyword">class</span> InputIt2, <span class="keyword">class</span> OutputIt&gt;</div><div class="line"><a name="l00415"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a8cc83e2fb7a3d8302db0f4b19513ddd9">  415</a></span>&#160;        OutputIt <a class="code" href="namespacenc_1_1stl__algorithms.html#a8cc83e2fb7a3d8302db0f4b19513ddd9">set_difference</a>(InputIt1 first1, InputIt1 last1,</div><div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;            InputIt2 first2, InputIt2 last2,</div><div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;            OutputIt destination)</div><div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;        {</div><div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a8cc83e2fb7a3d8302db0f4b19513ddd9">std::set_difference</a>(std::execution::par_unseq,</div><div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;                first1, last1, first2, last2, destination);</div><div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a8cc83e2fb7a3d8302db0f4b19513ddd9">std::set_difference</a>(first1, last1, first2, last2, destination);</div><div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;        }</div><div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;</div><div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt1, <span class="keyword">class</span> InputIt2, <span class="keyword">class</span> OutputIt&gt;</div><div class="line"><a name="l00439"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a6d7aea8b69f7e1a1129daad900a4917d">  439</a></span>&#160;        OutputIt <a class="code" href="namespacenc_1_1stl__algorithms.html#a6d7aea8b69f7e1a1129daad900a4917d">set_intersection</a>(InputIt1 first1, InputIt1 last1,</div><div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;            InputIt2 first2, InputIt2 last2,</div><div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;            OutputIt destination)</div><div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;        {</div><div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a6d7aea8b69f7e1a1129daad900a4917d">std::set_intersection</a>(std::execution::par_unseq,</div><div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;                first1, last1, first2, last2, destination);</div><div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a6d7aea8b69f7e1a1129daad900a4917d">std::set_intersection</a>(first1, last1, first2, last2, destination);</div><div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;        }</div><div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;</div><div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt1, <span class="keyword">class</span> InputIt2, <span class="keyword">class</span> OutputIt&gt;</div><div class="line"><a name="l00463"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#adda22e93ced5035c66f63532ee1408b4">  463</a></span>&#160;        OutputIt <a class="code" href="namespacenc_1_1stl__algorithms.html#adda22e93ced5035c66f63532ee1408b4">set_union</a>(InputIt1 first1, InputIt1 last1,</div><div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;            InputIt2 first2, InputIt2 last2,</div><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;            OutputIt destination)</div><div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;        {</div><div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#adda22e93ced5035c66f63532ee1408b4">std::set_union</a>(std::execution::par_unseq,</div><div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;                first1, last1, first2, last2, destination);</div><div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#adda22e93ced5035c66f63532ee1408b4">std::set_union</a>(first1, last1, first2, last2, destination);</div><div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;        }</div><div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;</div><div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> RandomIt&gt;</div><div class="line"><a name="l00483"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a4987a29c6a989094d647f5a6de75cc6f">  483</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a4987a29c6a989094d647f5a6de75cc6f">sort</a>(RandomIt first, RandomIt last)</div><div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;        {</div><div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a4987a29c6a989094d647f5a6de75cc6f">std::sort</a>(std::execution::par_unseq, first, last);</div><div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a4987a29c6a989094d647f5a6de75cc6f">std::sort</a>(first, last);</div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;        }</div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> RandomIt, <span class="keyword">class</span> Compare&gt;</div><div class="line"><a name="l00501"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a0a7faa16f597cc09d2540b2edf467fee">  501</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#a0a7faa16f597cc09d2540b2edf467fee">stable_sort</a>(RandomIt first, RandomIt last, Compare comp)</div><div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;        {</div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a0a7faa16f597cc09d2540b2edf467fee">std::stable_sort</a>(std::execution::par_unseq, first, last, comp);</div><div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;            <a class="code" href="namespacenc_1_1stl__algorithms.html#a0a7faa16f597cc09d2540b2edf467fee">std::stable_sort</a>(first, last, comp);</div><div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;        }</div><div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;</div><div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt, <span class="keyword">class</span> OutputIt, <span class="keyword">class</span> UnaryOperation&gt;</div><div class="line"><a name="l00521"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#a65dada83abf2bf7a4fe6bd5a7b00624e">  521</a></span>&#160;        OutputIt <a class="code" href="namespacenc_1_1stl__algorithms.html#a65dada83abf2bf7a4fe6bd5a7b00624e">transform</a>(InputIt first, InputIt last, OutputIt destination,</div><div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;            UnaryOperation unaryFunction) noexcept</div><div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;        {</div><div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#af110f81b7580e3bddbbfeea2fb92134b">std::transform</a>(std::execution::par_unseq, first, last, destination, unaryFunction);</div><div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#af110f81b7580e3bddbbfeea2fb92134b">std::transform</a>(first, last, destination, unaryFunction);</div><div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;        }</div><div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;</div><div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;        <span class="comment">//============================================================================</span></div><div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;        <span class="comment">// Method Description:</span></div><div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;<span class="comment"></span>        <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIt1, <span class="keyword">class</span> InputIt2, <span class="keyword">class</span> OutputIt, <span class="keyword">class</span> BinaryOperation&gt;</div><div class="line"><a name="l00543"></a><span class="lineno"><a class="line" href="namespacenc_1_1stl__algorithms.html#af110f81b7580e3bddbbfeea2fb92134b">  543</a></span>&#160;        OutputIt <a class="code" href="namespacenc_1_1stl__algorithms.html#a65dada83abf2bf7a4fe6bd5a7b00624e">transform</a>(InputIt1 first1, InputIt1 last1, InputIt2 first2,</div><div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;            OutputIt destination, BinaryOperation unaryFunction) noexcept</div><div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;        {</div><div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;<span class="preprocessor">#ifdef PARALLEL_ALGORITHMS_SUPPORTED</span></div><div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#af110f81b7580e3bddbbfeea2fb92134b">std::transform</a>(std::execution::par_unseq,</div><div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;                first1, last1, first2, destination, unaryFunction);</div><div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="namespacenc_1_1stl__algorithms.html#af110f81b7580e3bddbbfeea2fb92134b">std::transform</a>(first1, last1, first2, destination, unaryFunction);</div><div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;        }</div><div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;        }</div><div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;        }</div><div class="ttc" id="namespacenc_1_1stl__algorithms_html_a65dada83abf2bf7a4fe6bd5a7b00624e"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a65dada83abf2bf7a4fe6bd5a7b00624e">nc::stl_algorithms::transform</a></div><div class="ttdeci">OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction) noexcept</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:521</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_ae2ab2d36f54efc167ea074348b0319fa"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#ae2ab2d36f54efc167ea074348b0319fa">nc::stl_algorithms::minmax_element</a></div><div class="ttdeci">std::pair&lt; ForwardIt, ForwardIt &gt; minmax_element(ForwardIt first, ForwardIt last)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:302</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a42bf8acb4c60400df32819dfd2507b33"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a42bf8acb4c60400df32819dfd2507b33">nc::stl_algorithms::is_sorted</a></div><div class="ttdeci">bool is_sorted(ForwardIt first, ForwardIt last)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:248</div></div>
<div class="ttc" id="namespacenc_html"><div class="ttname"><a href="namespacenc.html">nc</a></div><div class="ttdef"><b>Definition:</b> Coordinate.hpp:45</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a8f91b4c9610973486b45eab8a5f04d3f"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a8f91b4c9610973486b45eab8a5f04d3f">nc::stl_algorithms::max_element</a></div><div class="ttdeci">ForwardIt max_element(ForwardIt first, ForwardIt last)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:266</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a74975591483e3e27b6de4c63bf5ff897"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a74975591483e3e27b6de4c63bf5ff897">nc::stl_algorithms::all_of</a></div><div class="ttdeci">bool all_of(InputIt first, InputIt last, UnaryPredicate p)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:55</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a946075f627d142f66626b03c30de8a16"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a946075f627d142f66626b03c30de8a16">nc::stl_algorithms::nth_element</a></div><div class="ttdeci">void nth_element(RandomIt first, RandomIt nth, RandomIt last)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:339</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a6d7aea8b69f7e1a1129daad900a4917d"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a6d7aea8b69f7e1a1129daad900a4917d">nc::stl_algorithms::set_intersection</a></div><div class="ttdeci">OutputIt set_intersection(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:439</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a8cc83e2fb7a3d8302db0f4b19513ddd9"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a8cc83e2fb7a3d8302db0f4b19513ddd9">nc::stl_algorithms::set_difference</a></div><div class="ttdeci">OutputIt set_difference(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:415</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_ab200b92040bf3da8ee4325f5a994e73d"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#ab200b92040bf3da8ee4325f5a994e73d">nc::stl_algorithms::equal</a></div><div class="ttdeci">bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:132</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_ab372e4e815977d16f647cdcfea3f1ea5"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#ab372e4e815977d16f647cdcfea3f1ea5">nc::stl_algorithms::find</a></div><div class="ttdeci">InputIt find(InputIt first, InputIt last, const T &amp;value)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:192</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a684d1011b375da4078afb4474a36b0e6"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a684d1011b375da4078afb4474a36b0e6">nc::stl_algorithms::equal</a></div><div class="ttdeci">bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) noexcept</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:153</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a86175072e60e0fabc931a8acd6329c77"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a86175072e60e0fabc931a8acd6329c77">nc::stl_algorithms::any_of</a></div><div class="ttdeci">bool any_of(InputIt first, InputIt last, UnaryPredicate p)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:74</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_ae1e1834ec458e90544d643b4b1e68735"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#ae1e1834ec458e90544d643b4b1e68735">nc::stl_algorithms::count</a></div><div class="ttdeci">std::iterator_traits&lt; InputIt &gt;::difference_type count(InputIt first, InputIt last, const T &amp;value)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:113</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_ab886383a0452b7240cf97d80b569e858"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#ab886383a0452b7240cf97d80b569e858">nc::stl_algorithms::min_element</a></div><div class="ttdeci">ForwardIt min_element(ForwardIt first, ForwardIt last)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:283</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a237a7b4514eff72fc35084f7004464d1"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a237a7b4514eff72fc35084f7004464d1">nc::stl_algorithms::inner_product</a></div><div class="ttdeci">T inner_product(InputIt1 first1, InputIt1 last1, InputIt2 first2, T init)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:230</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_abbc2e8d742b76f4c2bead6ae894bc4e3"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#abbc2e8d742b76f4c2bead6ae894bc4e3">nc::stl_algorithms::fill</a></div><div class="ttdeci">void fill(ForwardIt first, ForwardIt last, const T &amp;value)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:172</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_afc0a193758bfb62333c4ed53ada9537d"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#afc0a193758bfb62333c4ed53ada9537d">nc::stl_algorithms::copy</a></div><div class="ttdeci">OutputIt copy(InputIt first, InputIt last, OutputIt destination)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:93</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a79bd84376c57067a06ea0302f4fc261a"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a79bd84376c57067a06ea0302f4fc261a">nc::stl_algorithms::rotate</a></div><div class="ttdeci">void rotate(ForwardIt first, ForwardIt firstN, ForwardIt last)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:394</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a8674f754c02402908901506e8681839f"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a8674f754c02402908901506e8681839f">nc::stl_algorithms::replace</a></div><div class="ttdeci">void replace(ForwardIt first, ForwardIt last, const T &amp;oldValue, const T &amp;newValue)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:358</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a734698435eabdbc5bdf93b195d7fb6a7"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a734698435eabdbc5bdf93b195d7fb6a7">nc::stl_algorithms::for_each</a></div><div class="ttdeci">void for_each(InputIt first, InputIt last, UnaryFunction f)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:210</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a51eb1633787552e33ebede44bf5557a2"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a51eb1633787552e33ebede44bf5557a2">nc::stl_algorithms::reverse</a></div><div class="ttdeci">void reverse(BidirIt first, BidirIt last)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:376</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_af110f81b7580e3bddbbfeea2fb92134b"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#af110f81b7580e3bddbbfeea2fb92134b">nc::stl_algorithms::transform</a></div><div class="ttdeci">OutputIt transform(InputIt1 first1, InputIt1 last1, InputIt2 first2, OutputIt destination, BinaryOperation unaryFunction) noexcept</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:543</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_aa8f79e15f5d691cc61bf56bd4299afed"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#aa8f79e15f5d691cc61bf56bd4299afed">nc::stl_algorithms::none_of</a></div><div class="ttdeci">bool none_of(InputIt first, InputIt last, UnaryPredicate p)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:321</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a0a7faa16f597cc09d2540b2edf467fee"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a0a7faa16f597cc09d2540b2edf467fee">nc::stl_algorithms::stable_sort</a></div><div class="ttdeci">void stable_sort(RandomIt first, RandomIt last, Compare comp)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:501</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_a4987a29c6a989094d647f5a6de75cc6f"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#a4987a29c6a989094d647f5a6de75cc6f">nc::stl_algorithms::sort</a></div><div class="ttdeci">void sort(RandomIt first, RandomIt last)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:483</div></div>
<div class="ttc" id="namespacenc_1_1random_html_a00229c23da25284daf436c0a338ea25c"><div class="ttname"><a href="namespacenc_1_1random.html#a00229c23da25284daf436c0a338ea25c">nc::random::f</a></div><div class="ttdeci">dtype f(dtype inDofN, dtype inDofD)</div><div class="ttdef"><b>Definition:</b> f.hpp:57</div></div>
<div class="ttc" id="namespacenc_1_1stl__algorithms_html_adda22e93ced5035c66f63532ee1408b4"><div class="ttname"><a href="namespacenc_1_1stl__algorithms.html#adda22e93ced5035c66f63532ee1408b4">nc::stl_algorithms::set_union</a></div><div class="ttdeci">OutputIt set_union(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)</div><div class="ttdef"><b>Definition:</b> StlAlgorithms.hpp:463</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_34171bd951b13a53aa9f237277a18e40.html">NumCpp</a></li><li class="navelem"><a class="el" href="dir_a0b3eef1c4a290b815c33ad6e7027cf3.html">Core</a></li><li class="navelem"><a class="el" href="_stl_algorithms_8hpp.html">StlAlgorithms.hpp</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
  </ul>
</div>
</body>
</html>
